Compass routing on geometric networks ( 1999 , Kranakis , Singh , Urrutia )
نویسندگان
چکیده
Wireless networks are often modelled using geometric graphs. Using only local geometric information to compute a sequence of distributed forwarding decisions that send a message to its destination, routing algorithms can succeed on several common classes of geometric graphs. These graphs’ geometric properties provide navigational cues that allow routing to succeed using only limited local information at each node.
منابع مشابه
Compass routing on geometric networks
Suppose that a traveler arrives in the city of Toronto, and wants to walk to the famous CN Tower, one of the tallest free-standing structures in the world. Our visitor, lacking a map of Toronto, is standing at an intersection fromwhich he can see the CN Tower, and several streets S1; : : : ; Sm from which he can choose to start his walk. A natural (and most likely safe) assumption is that our v...
متن کاملMemory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that it is executed by an agent moving along a network and using at each node only information about the current node (incl. its position) and a finite number of others (independent of graph size). Local geometric traversal algorit...
متن کاملRoute Discovery with Constant Memory in Oriented Planar Geometric Networks
We address the problem of discovering routes in strongly connected planar geometric networks with directed links. We consider two types of directed planar geometric networks: Eulerian (in which every vertex has the same number of ingoing and outgoing edges) and outerplanar (in which a single face contains all the vertices of the network). Motivated by the necessity for establishing communicatio...
متن کاملBubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
This paper presents the rst dynamic routing scheme for high-speed networks. The scheme is based on a hierarchical bubbles partition of the underlying communication graph. Dynamic routing schemes are ranked by their adaptability, i.e., the maximum number of sites to be updated upon a topology change. An advantage of our scheme is that it implies small number of updates upon a topology change. In...
متن کاملAOI-cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing
This paper presents a novel AOI-cast algorithm for Distributed Virtual Environments targeted to Delaunaybased P2P overlays. The algorithm exploits the mathematical properties of the Delaunay Triangulations to build a spanning tree supporting the notification of the events generated by a peer to the other ones located in its Area of Interest (AOI). The spanning tree is computed by reversing comp...
متن کامل